Proof Principles of CSP – CSP-Prover in Practice
نویسندگان
چکیده
The process algebra Csp provides a well-established formalism for the modelling, analysis, and verification of concurrent systems. Besides being a specification language, Csp provides a valuable set of proof principles. We show in tutorial style, how these proof principles are made available in our tool Csp-Prover. Overall, Csp-Prover turns out to be an off-the-shelf proof tool ready for use in applications.
منابع مشابه
The Stable Revivals Model in CSP-Prover
The stable revivals model R provides a new semantic framework for the process algebra Csp. The model R has recently been added to the realm of established Csp models. Within the Csp context, it enhances the analysis of systems with regards to properties such as responsiveness and stuckness. These properties are essential in component based system design. In this paper we report on the implement...
متن کاملCSP-Prover – a Proof Tool for the Verification of Scalable Concurrent Systems
The process algebra Csp [1] [4] [15] [16] is a formal method devoted to the modelling as well as to the analysis and verification of concurrent systems. It is a speciality of Csp that it captures both, the concurrent system as well as its desired properties, as specifications: Let Sys be the formal Csp model of a concurrent system, let P be a property formulated in Csp – such a property could, ...
متن کاملExtending CSP-Prover by deadlock-analysis: Towards the verification of systolic arrays
Csp-Prover provides a deep encoding of the process algebra Csp in the interactive theorem prover Isabelle. Here, we extend Csp-Prover by a framework for the deadlock-analysis of networks. As a typical example we study systolic arrays and prove in Csp-Prover that Kung's classical algorithm for matrix-multiplication is deadlock-free. 1 Introduction Among the various frameworks for the description...
متن کاملA Generic Theorem Prover of CSP Refinement
We describe a new tool called Csp-Prover which is an interactive theorem prover dedicated to refinement proofs within the process algebra Csp. It aims specifically at proofs for infinite state systems, which may also involve infinite non-determinism. Semantically, Csp-Prover supports both the theory of complete metric spaces as well as the theory of complete partial orders. Both these theories ...
متن کاملCSP-CASL-Prover — Tool integration and algorithms for automated proof generation
The specification language Csp-Casl allows one to model data as well as processes of distributed systems within one framework. In our paper, we describe how a combination of the existing tools HETS and Csp-Prover can solve the challenges that Csp-Casl raises on integrated theorem proving for processes and data. For building this new tool, the automated generation of theorems and their proofs in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007